Smoothed State Estimation via Efficient Solution of Linear Equations
نویسندگان
چکیده
منابع مشابه
Efficient Solution of Large Sparse Linear Equations
Algebraic attacks is a powerful type of attacks against LFSR-based stream ciphers. Solving large sparse linear equations Ax = b is needed for this attack. The traditional Gaussian elimination is not efficient for such matrix equations because of its cube run time complexity. Quadratic run time algorithms like Lanczos or Wiedemann Methods are the better for such large sparse matrices. We impleme...
متن کاملNumerical solution of system of linear integral equations via improvement of block-pulse functions
In this article, a numerical method based on improvement of block-pulse functions (IBPFs) is discussed for solving the system of linear Volterra and Fredholm integral equations. By using IBPFs and their operational matrix of integration, such systems can be reduced to a linear system of algebraic equations. An efficient error estimation and associated theorems for the proposed method are also ...
متن کاملNew solution of fuzzy linear matrix equations
In this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (FLMEs) of the form AX = B; where Ais a crisp matrix, B is a fuzzy number matrix and the unknown matrix X one,is presented. Then a numerical example is presented to illustrate the proposedmodel.
متن کاملQuantum State Tomography via Linear Regression Estimation
A simple yet efficient state reconstruction algorithm of linear regression estimation (LRE) is presented for quantum state tomography. In this method, quantum state reconstruction is converted into a parameter estimation problem of a linear regression model and the least-squares method is employed to estimate the unknown parameters. An asymptotic mean squared error (MSE) upper bound for all pos...
متن کاملProcessor Efficient Parallel Solution of Linear Systems of Equations
We present a deterministic parallel algorithm that solves a n-dimensional system Ax b of linear equations over an ordered field or over a subfield of the complex Ž 2 . Ž Ž . 2 numbers. This algorithm uses O log n parallel time and O max M n , n Ž . 4. Ž . log log n log n arithmetic processors if M n is the processor complexity of fast parallel matrix multiplication. 2000 Academic Press
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.323